Mathematical programming with multiple sets split monotone variational inclusion constraints
نویسندگان
چکیده
منابع مشابه
Mathematical programming with multiple sets split monotone variational inclusion constraints
In this paper, we first study a hierarchical problem of Baillon’s type, and we study a strong convergence theorem of this problem. For the special case of this convergence theorem, we obtain a strong convergence theorem for the ergodic theorem of Baillon’s type. Our result of the ergodic theorem of Baillon’s type improves and generalizes many existence theorems of this type of problem. Two nume...
متن کاملSplit Monotone Variational Inclusions
Based on the very recent work by Censor-Gibali-Reich [7], we propose an extension of their new variational problem (Split Variational Inequality Problem) to monotone variational inclusions. Relying on the Krasnoselskii-Mann Theorem for averaged operators, we analyze an algorithm for solving a new split monotone inclusions under weaker conditions. Our results improve and develop previously discu...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملRelatively monotone variational inequalities over product sets
New concepts of monotonicity which extend the usual ones are introduced for variational inequality problems over product sets. They enable us to strengthen existence results and extend the eld of applications of the solution methods. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملSolving Inclusion Constraints between intensional sets
Tools allowing set manipulations are generally accepted by the logic programming community as providing a very \ad-hoc" formulation of a number of problems. Most of the existing approaches to deal with sets in a constraint logic programming framework work with exten-sional ((nite) sets, or (innnite) regular sets using tree automatas. But intensional sets are often forbidden, or supposed to be n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2014
ISSN: 1687-1812
DOI: 10.1186/1687-1812-2014-20